Binding without variables: Solving the under-generation problems

نویسندگان

چکیده

The variable-free semantics of Jacobson (1999, 2000, 2014) derives binding relations by the local application z-rule. This rule, however, under- generates binding. paper makes two contributions: (i) replacing z-rule with a more flexible rule called i (a la W-combinator Szabolcsi 1992), which allows for relations; (ii) enriching Jacobson’s system and proposing two-dimensional analysis to account interactions between scoping Issues be covered include into adjuncts, possessor binding, scope ambiguity, inverse linking, weak crossover, ‘paycheck pronouns’.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Spectra without Solving Eigenvalue Problems

The approximation of the eigenvalues and eigenfunctions of an elliptic operator is a key computational task in many areas of applied mathematics and computational physics. An important case, especially in quantum physics, is the computation of the spectrum of a Schrödinger operator with a disordered potential. Unlike plane waves or Bloch waves that arise as Schrödinger eigenfunctions for period...

متن کامل

Solving Difficult HTM Problems Without Difficult Hardware

There are several classes of operations, including I/O and memory allocation, that are considered difficult to perform as part of a transaction. To allow such operations inside of transactions, previous hardware transactional memory systems have proposed additional mechanisms such as opennested transactions that use hardware management of software handlers. Open-nested transactions are not nece...

متن کامل

Solving Fuzzy Temporal Problems Without Backtracking

The Disjunctive Fuzzy Temporal Constraint Network model allows to express complex qualitative and quantitative temporal constraints, but its complexity is exponential. There are several subsets of these networks that can be solved in polynomial time. Another subset can be reduced to equivalent networks with a tree structure. In order to study the usefulness of these approaches, an evaluation ha...

متن کامل

Solving Norm Errors–in–variables Problems Using Particle Swarm Optimization

ABSTRACT In this paper we deal with the solution of norm data fitting problems, which have errors in all variables. These problems can be solved using the well–known Trust Region methods [14, 16]. Alternatively, we tackle these problems by applying the Particle Swarm Optimization (PSO) technique [3, 6, 7]. The ability to work within high dimensional search spaces as well as on non–differentiabl...

متن کامل

On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables

Many mixed-integer constraint satisfaction problems and global optimization problems contain some variables with unbounded domains. Their solution by branch and bound methods to global optimality poses special challenges as the search region is infinitely extended. Many usually strong bounding methods lose their efficiency or fail altogether when infinite domains are involved. Most implemented ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Semantics and Linguistic Theory

سال: 2022

ISSN: ['2163-5943', '2163-5951']

DOI: https://doi.org/10.3765/salt.v31i0.5118